// BestTimeBuyAndSellStockII.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>
using namespace std;
//Say you have an array for which the ith element is the price of a given stock on day i.

//Design an algorithm to find the maximum profit. 
//You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). 
//However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

int maxProfit(vector<int> &prices) 
{
	if(prices.size() <= 0)
		return 0;
	int maxProfitNum = 0;
	for(int i = 1; i< prices.size(); i++)
	{
		if(prices[i] - prices[i-1] > 0)
			maxProfitNum+= (prices[i] - prices[i-1] );
	}
	return maxProfitNum;
}
int _tmain(int argc, _TCHAR* argv[])
{
	return 0;
}

